A unified approach to type theory through a refined λ-calculus
نویسندگان
چکیده
منابع مشابه
A Unified Approach to Type Theory Through a Refined lambda-Calculus
A-calculus is at the heart of type theory while type theory has heen the most stimulating part of the theory of Computation. The presence however of various type systems provokes attempts at finding a unified way of describing these systems. Barendregt's cube for example, is such an attempt. Based on these observations, we will devise a new A-notation which enables categorising most of the know...
متن کاملType Theory 2011 – Parigot ’ s λ μ - calculus Robbert
1 Terms and types Whereas most other systems with control, for example λ C [FF86, Gri90] or λ ∆ [RS94], use ordinary λ-variables to represent continuations, λ µ distinguishes λ-variables from continuation variables. Also, the terms are of a more restricted shape because the system distinguishes between terms and commands. Definition 1.1. Simple types are inductively defined over an infinite set...
متن کاملA Uniied Approach to Type Theory through a Reened
In the area of foundations of mathematics and computer science, three related topics dominate. These are -calculus, type theory and logic. There are moreover, many versions of -calculi and type theories. In these versions, the presence of logic ranges from the non-existant to the dominant. In fact, the three subjects of -calculus, logic and type theory, got separated due to the appearence of th...
متن کاملA Unified Approach to Theory Reasoning
Theory reasoning is a kind of two-level reasoning in automated theorem proving, where the knowledge of a given domain or theory is separated and treated by special purpose inference rules. We define a classification for the various approaches for theory reasoning which is based on the syntactic concepts of literal level — term level — variable level. The main part is a review of theory extensio...
متن کاملA Unified Approach to Algebraic Set Theory
Categorical logic studies the relation between category theory and logical languages, and provides a very efficient framework in which to treat the syntax and the model theory on an equal footing. For a given theory T formulated in a suitable language, both the theory itself and its models can be viewed as categories with structure, and the fact that the models are models of the theory correspo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00127-5